Adaptive Voxel Subdivision for Ray Tracing

نویسنده

  • Brian Wyvill
چکیده

Although regular subdivision has been shown to be efficient at ray tracing scenes where objects are evenly distributed, such algorithms perform poorly when objects are concentrated in a small number of voxels. In this paper, a method is presented where voxels in a regular grid are examined and recursively subdivided depending on object density. This integration of regular and adaptive spatial subdivision methods allows images consisting of large regularly distributed objects and small dense objects to be ray traced efficiently. The parameters controlling the coarseness of the voxel grid, depth of adaptive subdi· vision trees, and maximum number of polygons per voxel are varied and their effects on execution time, subdivision time, and memory use are measured.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Faster Ray Tracing Using Adaptive Grids

fficient ray tracing has been a contradiction in terms since its introduction as a computer version of ideas found in Dürer's Underweysung der Messung (1525) and Descartes' La Dioptrique (1637). The most effective acceleration techniques developed to reduce ray tracing's high computational cost are based on space coherence: bounding box hierarchies and space subdivision. 1 During pre-processing...

متن کامل

Object Space Temporal Coherence for Ray Tracing

A method is presented for exploiting object space temporal coherence to speed up ray tracing of animation sequences where the camera remains static. The object space is subdivided with a hierarchical voxel grid structure. Each voxel keeps a list of the rays that pass through it when the first frame of a sequence is rendered. To render a successive frame, only rays that passed through voxels in ...

متن کامل

Cost Distribution Prediction for Parallel Ray Tracing

Realistic rendering algorithms such as ray tracing are computationally very expensive. The time complexity is determined by a multitude of factors such as image size, geometry, material properties and the quality of the required rendering. This paper presents an algorithm to estimate the cost of ray tracing a scene. Assuming an octree spatial subdivision, the cost per voxel is predicted. For pa...

متن کامل

Exploiting Shadow Coherence in Ray Tracing

We present a method, based on Haines' shadow caches, for accelerating shadow ray calculations for Tay tracing processes which use spatial subdivision and surface tessellation. Trees of shadow voxel caches, containing references to both objects and voxels, are used to quickly determine whether or not a surface lies in shadow. This method does not require an additional preprocessing stage before ...

متن کامل

Adaptive Ray Tracing of Subdivision Surfaces

Subdivision Surfaces as well as (interactive) ray tracing have become an important issue in computer graphics. But ray tracing of subdivision surfaces has received only little attention. We present a new approach for ray tracing of subdivision surfaces. The algorithm uses a projection of the ray onto the surface and works mainly in two dimensions along this projection. While proceeding from pat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015